General neighbour-distinguishing index of a graphGYORI, Ervin; HORNAK, Mirko; PALMER, Cory et al.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 827-831, issn 0012-365X, 5 p.Conference Paper

The circular chromatic index of Goldberg snarksGHEBLEH, Mohammad.Discrete mathematics. 2007, Vol 307, Num 24, pp 3220-3225, issn 0012-365X, 6 p.Article

Edge colouring line graphs of unicyclic graphsCAI, L; ELLIS, J. A.Discrete applied mathematics. 1992, Vol 36, Num 1, pp 75-82, issn 0166-218XArticle

Observability of the extended Fibonacci cubesWHITEHEAD, Carol; ZAGAGLIA SALVI, Norma.Discrete mathematics. 2003, Vol 266, Num 1-3, pp 431-440, issn 0012-365X, 10 p.Conference Paper

Fast parallel algorithms for the approximate edge-coloring problemLIANG, W.Information processing letters. 1995, Vol 55, Num 6, pp 333-338, issn 0020-0190Article

r-Strong edge colorings of graphsAKBARI, S; BIDKHORI, H; NOSRATI, N et al.Discrete mathematics. 2006, Vol 306, Num 23, pp 3005-3010, issn 0012-365X, 6 p.Conference Paper

Parallel concepts in graph theoryHARARY, F.Mathematical and computer modelling. 1993, Vol 18, Num 7, pp 101-105, issn 0895-7177Article

Alternating Hamiltonian circuits in edge-coloured bipartite graphsHILTON, A. J. W.Discrete applied mathematics. 1992, Vol 35, Num 3, pp 271-273, issn 0166-218XArticle

List edge chromatic number of graphs with large girthKOSTOCHKA, A. V.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 189-201, issn 0012-365XArticle

Some sufficient conditions for a planar graph of maximum degree six to be Class 1YUEHUA BU; WEIFAN WANG.Discrete mathematics. 2006, Vol 306, Num 13, pp 1440-1445, issn 0012-365X, 6 p.Article

Strong edge-coloring of graphs with maximum degree 4 using 22 colorsCRANSTON, Daniel W.Discrete mathematics. 2006, Vol 306, Num 21, pp 2772-2778, issn 0012-365X, 7 p.Article

Edge-coloring critical graphs with high degreeMIAO, Lian-Ying; WU, Jian-Liang.Discrete mathematics. 2002, Vol 257, Num 1, pp 169-172, issn 0012-365X, 4 p.Article

Edge-chromatic critical graphs and the existence of 1-factorsCHOUDUM, S. A.Journal of graph theory. 1993, Vol 17, Num 1, pp 23-29, issn 0364-9024Article

Incidence and strong edge colorings of graphsBRUALDI, R. A; QUINN MASSEY, J. J.Discrete mathematics. 1993, Vol 122, Num 1-3, pp 51-58, issn 0012-365XArticle

A note on Vizing's independence number conjecture of edge chromatic critical graphsRONG LUO; YUE ZHAO.Discrete mathematics. 2006, Vol 306, Num 15, pp 1788-1790, issn 0012-365X, 3 p.Article

Construction of sports schedules with multiple venuesDE WERRA, D; EKIM, T; RAESS, C et al.Discrete applied mathematics. 2006, Vol 154, Num 1, pp 47-58, issn 0166-218X, 12 p.Article

Irreducible snarks of given order and cyclic connectivityMACAJOVA, Edita; SKOVIERA, Martin.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 779-791, issn 0012-365X, 13 p.Article

The strong chromatic index of a cubic graph is at most 10DØVLING ANDERSEN, L.Discrete mathematics. 1992, Vol 108, Num 1-3, pp 231-252, issn 0012-365XArticle

On a construction of graphs with high chromatic capacity and large girthBING ZHOU.Discrete mathematics. 2010, Vol 310, Num 17-18, pp 2452-2454, issn 0012-365X, 3 p.Article

Improved bounds on acyclic edge colouringMUTHU, Rahul; NARAYANAN, N; SUBRAMANIAN, C. R et al.Discrete mathematics. 2007, Vol 307, Num 23, pp 3063-3069, issn 0012-365X, 7 p.Article

Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-completeBRYANT, Darryn.Discrete mathematics. 2009, Vol 309, Num 14, pp 4700-4704, issn 0012-365X, 5 p.Article

Some sufficient conditions for a graph to be of C_f 1XIA ZHANG; GUIZHEN LIU.Applied mathematics letters. 2006, Vol 19, Num 1, pp 38-44, issn 0893-9659, 7 p.Article

On partitioning two matroids into common independent subsetsKOTLAR, Daniel; ZIV, Ran.Discrete mathematics. 2005, Vol 300, Num 1-3, pp 239-244, issn 0012-365X, 6 p.Article

On the fractional chromatic index of a graph and its complementAVIS, David; DE SIMONE, Caterina; REED, Bruce et al.Operations research letters. 2005, Vol 33, Num 4, pp 385-388, issn 0167-6377, 4 p.Article

The Petersen graph is not 3-edge-colorable: a new proofNASERASR, Reza; SKREKOVSKI, Riste.Discrete mathematics. 2003, Vol 268, Num 1-3, pp 325-326, issn 0012-365X, 2 p.Article